Basis theorems for continuous n-colorings
نویسندگان
چکیده
منابع مشابه
Basis theorems for continuous n-colorings
This article is devoted to the study of continuous colorings of the n-element subsets of a Polish space. The homogeneity number hm(c) of an n-coloring c : [X]n → 2 is the least size of a family of c-homogeneous sets that covers X. An n-coloring is uncountably homogeneous if hm(c) > א0. Answering a question of B. Miller, we show that for every n > 1 there is a finite family B of continuous n-col...
متن کاملFull Color Theorems for L(2, 1)-Colorings
The span λ(G) of a graph G is the smallest k for which G’s vertices can be L(2, 1)-colored, i.e., colored with integers in {0, 1, . . . , k} so that adjacent vertices’ colors differ by at least two, and colors of vertices at distance two differ. G is full-colorable if some such coloring uses all colors in {0, 1, . . . , λ(G)} and no others. We prove that all trees except stars are full-colorabl...
متن کاملRainbow Ramsey Theorems for Colorings Establishing Negative Partition Relations
Given a function f a subset of its domain is a rainbow subset for f if f is one to one on it. We start with an old Erdős Problem: Assume f is a coloring of the pairs of ω1 with three colors such that every subset A of ω1 of size ω1 contains a pair of each color. Does there exist a rainbow triangle ? We investigate rainbow problems and results of this style for colorings of pairs establishing ne...
متن کاملPatch Colorings and Rigid Colorings of the Rational n-Space
We investigate k-colorings of the rational n-space, Q, such that any two points at distance one get distinct colors. Two types of colorings are considered: patch colorings where the colors occupy open sets with parts of their boundary, and rigid colorings which uniquely extend from any open subset of Q. We prove that the existence of a patch k-coloring of Q implies the existence of a k-coloring...
متن کاملOn the consistency of some partition theorems for continuous colorings, and the structure of aleph1-dense real order types
We present some techniques in C.C.C. forcing, and apply them to prove consistency results concerning the isomorphism and embeddability relations on the family of X,-dense sets of real numbers. In this direction we continue the work of Baumgartner [2] who proved the axiom BA stating that every two Xi-dense subsets of R are isomorphic, is consistent. We e.g. prove Con(BA+ (2’0 > X,)). Let (KH, S)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2011
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2010.12.006